Cyclic staff scheduling: optimization models for some real-life problems
نویسندگان
چکیده
منابع مشابه
Solving Real-Life Locomotive-Scheduling Problems
The locomotive scheduling problem (or the locomotive assignment problem) is to assign a consist (a set of locomotives) to each train in a pre-planned train schedule so as to provide them sufficient power to pull them from their origins to their destinations. Locomotive scheduling problems are among the most important problems in railroad scheduling. In this paper, we report the results of a stu...
متن کاملPrecedence Constraint Posting for Cyclic Scheduling Problems
Resource constrained cyclic scheduling problems consist in planning the execution over limited resources of a set of activities, to be indefinitely repeated. In such a context, the iteration period (i.e. the difference between the completion time of consecutive iterations) naturally replaces the makespan as a quality measure; exploiting inter-iteration overlapping is the primary method to obtai...
متن کاملCyclic Scheduling and Diophantine Problems
Cyclic scheduling concerns both kinds of questions following the deductive and inductive ways of reasoning. First class of problems concentrates on rules aimed at resources assignment as to minimize a given objective function, e.g. the cycle time, the flow time of a job. In turn, the second class focuses on a system structure designing as to guarantee the assumed qualitative and/or quantitative...
متن کاملDe-Cycling Cyclic Scheduling Problems
An elegant way to tackle a problem that you cannot solve is to cast it to a problem that you can solve very well. Cyclic Scheduling problems are very similar to Resource Constrained Project Scheduling Problems (RCPSP), except that the project activities are repeated over time. Due to the similarity, reducing Cyclic Scheduling problems to RCPSPs seems an appealing approach. In this paper we disc...
متن کاملA Comparison of Optimization Algorithms for Practical Staff Scheduling Problems in Logistics and Retailing
The current paper uses real-life scenarios of staff scheduling applications to compare the effectiveness and efficiency of two fundamentally different solution approaches. One can be called centralised and is based on search in the solution space with two adapted metaheuristic, namely particle swarm optimization (PSO) and evolution strategy (ES). The second approach, a multi-agent system (MAS),...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scheduling
سال: 2012
ISSN: 1094-6136,1099-1425
DOI: 10.1007/s10951-012-0299-4